Axiomatizing Kripke's Theory of Truth
نویسندگان
چکیده
We investigate axiomatizations of Kripke’s [18] theory of truth based on the Strong Kleene evaluation scheme for treating sentences lacking a truth value. Feferman’s axiomatization KF formulated in classical logic is an indirect approach, because it is not sound with respect to Kripke’s semantics in the straightforward sense; only the sentences provably true in KF are valid in Kripke’s partial models. Reinhardt proposed to focus just on the sentences that can be proved to be true in KF and conjectured that the detour through classical logic in KF is dispensable. We refute Reinhardt’s Conjecture, and provide a direct axiomatization PKF of Kripke’s theory in partial logic. We argue that any natural axiomatization of Kripke’s theory in Strong Kleene logic has the same proof-theoretic strength as PKF, namely the strength of ramified analysis RA<ωω or a system of Tarskian ramified truth up to ω and thus any such axiomatization is much weaker than Feferman’s axiomatization KF in classical logic, which is equivalent to ramified analysis RA< 0 up to 0. Wovon man nicht sprechen kann, darüber muß man schweigen. adapted from Wittgenstein, Tractatus logico-philosophicus 7 §
منابع مشابه
Supervaluation on Trees for Kripke's Theory of Truth
A method of supervaluation for Kripke's theory of truth is presented. It di ers from Kripke's own method in that it employs trees; results in a compositional semantics; assigns the intuitively correct truth values to the sentences of a particularly tricky example of Gupta's; and it is argued is acceptable as an explication of the correspondence theory of truth. In his (1982) Gupta presents the ...
متن کاملFriedman and the Axiomatization of Kripke's Theory of Truth
What is the simplest and most natural axiomatic replacement for the set-theoretic definition of the minimal fixed point on the Kleene scheme in Kripke's theory of truth? What is the simplest and most natural set of axioms and rules for truth whose adoption by a subject who had never heard the word "true" before would give that subject an understanding of truth for which the minimal fixed point ...
متن کاملNotes on the mathematical aspects of Kripke's theory of truth
/ Introduction Kripke's Theory of Truth [3] is one of the most interesting developments to come along in this area for some time. But the mathematical difficulties may have prevented a wider appreciation of its philosophical virtues. Certainly more is required of the reader than in Tarski's approach; indeed the mathematical machinery involved strictly includes that required by Tarski's theory. ...
متن کاملA Reflection on Russell's Ramified Types and Kripke's Hierarchy of Truths
Both in Kripke's Theory of Truth ktt 8] and Russell's Ramiied Type Theory rtt 16, 9] we are confronted with some hierarchy. In rtt, we have a double hierarchy of orders and types. That is, the class of propositions is divided into diierent orders where a propositional function can only depend on objects of lower orders and types. Kripke on the other hand, has a ladder of languages where the tru...
متن کاملAxiomatizing truth in a finite model
Given a finite model, we build an axiomatic theory such that the propositions provable in this theory are those valid in the model. We sketch applications to automated theorem proving.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 71 شماره
صفحات -
تاریخ انتشار 2006